PH‐RLS: A parallel hybrid recursive least square algorithm for self‐mixing interferometric laser sensor
نویسندگان
چکیده
The authors present the parallel-hybrid recursive least square (PH-RLS) algorithm for an accurate self-mixing interferometric laser vibration sensor coupled with accelerometer under industrial conditions. Previously, this was achieved by using a conventional RLS to cancel parasitic vibrations where itself is not in stationary environment. This operates sequential mode and due its compute data-intensive nature, does work real-time applications, hence requires parallel computing. Therefore, existing C program parallelized hybrid OpenACe C/MPI (Open Accelerators/Message Passing Interface) programming models tested on Barcelona Supercomputing Center CTE-Power9 Supercomputer. computational performance of proposed PH-RLS compared code executing multi distributed processors uni-core processor architecture, respectively. While comparing eight nodes supercomputer, results show that gets 5857 times improvement as implementation single node system. also gives scalable different range signals, making it suitable choice interferometer sensing systems working
منابع مشابه
Recursive least-squares using a hybrid Householder algorithm on massively parallel SIMD systems
Within the context of recursive least-squares, the implementation of a Householder algorithm for block updating the QR decomposition, on massively parallel SIMD systems, is considered. Initially, two implementations based on dierent mapping strategies for distributing the data matrices over the processing elements of the parallel computer are investigated. Timing models show that neither of th...
متن کاملLeast Mean Square Algorithm
The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...
متن کاملLeast Mean Square Algorithm
The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...
متن کاملRegularized Kernel Recursive Least Square Algoirthm
In most adaptive signal processing applications, system linearity is assumed and adaptive linear filters are thus used. The traditional class of supervised adaptive filters rely on error-correction learning for their adaptive capability. The kernel method is a powerful nonparametric modeling tool for pattern analysis and statistical signal processing. Through a nonlinear mapping, kernel methods...
متن کاملA square root covariance algorithm for constrained recursive least squares estimation
In this contribution, a covariance counterpart is described of the information matrix approach to constrained recursive least squares estimation. Unlike information-type algorithms, covariance algorithms are amenable to parallel implementation, e.g. on processor arrays, and this is also demonstrated. As compared to previously described combined covariance-information algorithms/arrays, the pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Iet Optoelectronics
سال: 2021
ISSN: ['1751-8776', '1751-8768']
DOI: https://doi.org/10.1049/ote2.12021